Performance of PKI-based security mechanisms in mobile ad hoc networks

Security for ad hoc network environments has received a lot of attention as of today. Previous work has mainly been focussing on secure routing, fairness issues, and malicious node detection. However, the issue of introducing and conserving trust relationships has received considerably less attention. In this article, we present a scalable method for the use of public key certificates and their revocation in mobile ad hoc networks (MANETs). With the LKN-ad hoc security framework (LKN-ASF) a certificate management protocol has been introduced, bringing PKI technology to MANETs. In addition a performance analysis of two different revocation approaches for MANETs will be presented.     

Joint scheduling and power control supporting multicasting in wireless ad hoc networks

This paper addresses the problem of power control in a multihop wireless network supporting multicast traffic. We face the problem of forwarding packet traffic to multicast group members while meeting constraints on the signal-to-interference-plus-noise ratio (SINR) at the intended receivers. First, we present a distributed algorithm which, given the set of multicast senders and their corresponding receivers, provides an optimal solution when it exists, which minimizes the total transmit power. When no optimal solution can be found for the given set of multicast senders and receivers, we introduce a distributed, joint scheduling and power control algorithm which eliminates the weak connections and tries to maximize the number of successful multicast transmissions. The algorithm allows the other senders to solve the power control problem and minimize the total transmit power. We show that our distributed algorithm converges to the optimal solution when it exists, and performs close to centralized, heuristic algorithms that have been proposed to address the joint scheduling and power control problem.     

无线Ad hoc 网络及其研究难点

无线Ad hoc网络作为没有基础设施的网络，在军事和民用方面具有广阔的应用前景，是目前网络研究中的热点问题。本文对无线Ad hoc网络进行了详细的论述，指出了目前研究中存在的一些难点。     

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.     

SWAN模型速率控制模块性能分析及改进

SWAN是Ad Hoe网络中的一种无状态网络协议，利用分布式控制算法来传递分类服务。这种QoS模型把数据业务分为两类进行不同处理，即对尽力而为的UDP和TCP业务采用速率控制的策略而对实时的UDP业务采用基于源节点的接纳控制策略。本文修改了SWAN模型的速率控制模块，引入队列调度机制，对从上层来的尽力而为数据包进行排队、调度，使其尽可能公平地占用新到资源。在分析中具体给出了修改后速率控制模块的实现过程。通过仿真分析了AIMD算法的参数对修改后速率控制模块性能的影响。     

基于多信道预约可冲突避免的多址接入协议

本文为多跳分布多无线网络提出了一套灵活而有效的自适应获取冲突避免（AACA）的多址接入协议。在该协议中，各节点竞争公共信道，利用RTS/CTS对话形式来预约各业务信道，成功预约后的分组传输不会受到其他节点的干扰。它使用任意确定数目信道，以异步方式工作，并且使得各节点利用半双工无线电台就可以灵活、简便地实现资源预约。分析和比较结果说明，所提出的多信道预约协议可以有效地解决隐藏终端、暴露终端以及侵入终端的问题。     

Performance analysis of IEEE 802.11 ad hoc networks in the presence of exposed terminals

The paper evaluates the performance effects of exposed terminals in IEEE 802.11 ad hoc networks in finite load conditions. It derives analytical models for the estimation of channel utilization and media access delay for IEEE 802.11 ad hoc networks in finite load conditions with and without exposed terminals. The simulation results show that the analytical estimated channel utilization and media access delay metrics are fairly accurate.     

Bandwidth‐guaranteed QoS routing of multiple parallel paths in CDMA/TDMA ad hoc wireless networks

This paper investigates the issues of QoS routing in CDMA/TDMA ad hoc networks. Since the available bandwidth is very limited in ad hoc networks, a QoS request between two nodes will be blocked if there does not exist a path that can meet the QoS requirements, even though there is enough free bandwidth in the whole system. In this paper, we propose a new scheme of using multiple paths between two nodes as the route for a QoS call. The aggregate bandwidth of the multiple paths can meet the bandwidth requirement of the call and the delays of these paths are within the required bound of the call. We also propose three strategies by which to choose a set of paths as the route, namely, shortest path first (SPF), largest bandwidth first (LBF), and largest hop‐bandwidth first (LHBF). Extensive simulations have been conducted to evaluate the performance of the three strategies in comparison with a traditional single path routing algorithm. The simulation results show that the proposed multiple paths routing scheme significantly reduces the system blocking rates in various network environments, especially when the network load is heavy. Copyright © 2005 John Wiley & Sons, Ltd.     

在ad hoc网络中一种新的节能路由切换模型

提出了一种基于能量消耗的路由切换模型(ERHM),它在路由维护中利用切换技术来使路由的能量消耗最小.仿真结果表明采用切换技术的ERHM模型的能量节省量要比不采用切换技术节约1.5～7.5倍,且节点的移动性越大,能量节约越多.